Feasible set functions have small circuits

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

C. elegans locomotion: small circuits, complex functions.

With 302 neurons in the adult Caenorhabditis elegans nervous system, it should be possible to build models of complex behaviors spanning sensory input to motor output. The logic of the motor circuit is an essential component of such models. Advances in physiological, anatomical, and neurogenetic analysis are revealing a surprisingly complex signaling network in the worm's small motor circuit. W...

متن کامل

Feasible Functions ∗

It is common to identify the class of computable functions with the class of functions computable by the Turing machine. The identification is done on the ground of the famous Church-Turing thesis. In fact, the thesis justifies only one implication: computable function are Turing computable. The other implication is quite obviously false if computability means practical computability. I am not ...

متن کامل

Semi-algebraic functions have small subdifferentials

We prove that the subdifferential of any semi-algebraic extended-real-valued function on Rn has n-dimensional graph. We discuss consequences for generic semi-algebraic optimization problems.

متن کامل

Testing of Functions that have small width Branching Programs

Combinatorial property testing, initiated formally by Goldreich, Goldwasser and Ron in [11], and inspired by Rubinfeld and Sudan [13], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is being ’far’ from having the property. The main result here is that if G = fg : f0; 1gn ! f0; 1gg is a family of ...

متن کامل

Entailment of Set Constraints Is Not Feasible

Set constraints are inclusions between expressions denoting sets of trees. They have been used extensively for type inference and program analysis. At the lower end of the expressiveness scale there are atomic set constraints and Ines constraints (inclusions over non-empty sets) for both of which a cubic time satissability test is known. Recently, there has been increasing interest in entailmen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computability

سال: 2018

ISSN: 2211-3576,2211-3568

DOI: 10.3233/com-180096